Why an informatics degree%3F%2
The abuse of structural rules may have damaging complexity effects. 1 INTRODUCTION : A LOGIC OF POLYTIME ?  We are seeking a A logic of polytime B. Not yet one more axiomatization, but an intrinsically polytime system. Our methodological bias will be to consider that the expressive power of a system is the complexity of its cut-elimination procedure, and we therefore seek a system with a polytime complexity for cutelimination (to be precise : besides the size of the proof, there will be an auxiliary parameter, the depth, controlling the degree of the polynomial). This cannot be achieved within classical or intuitionistic logics, because of structural rules, especially contraction : this is why the complexity of cut-elimination in all extant logical systems (including the standard version of linear logic which controls structural rules without forbidding them) is catastrophic, elementary (towers of exponentials) or worse. Light Linear Logic is a purely logical system with a more careful...


Redesigning video analysis an interactive ink annotation tool.

Improving computer science diversity through summer camps.

Looking good on the web evaluating the visual impact of political websites.

Improving computer science diversity through summer camps.

How Students Perceive Risk A Study of Senior Capstone Project Teams.

Tracking and Organizing Visual Exploration Activities across Systems and Tools.

Visualizing Distributions and Classification Accuracy.

Designing and Developing an Informatics Capstone Project Course.

Visualizing Distributions and Classification Accuracy.

USEable security interface design strategies for improving security.

USEable security interface design strategies for improving security.

Provenance and Annotation for Visual Exploration Systems.

Enhancing 3D File Search with Landscapes and Personal Histories Exploring the Possibilities of TerraSearch .

A collaborative annotation system for data visualization.

An Evaluation of a Rule%2DBased Language for Classification Queries.

Tracking User Interactions Within Visualizations.

Information Provenance and the Knowledge Rediscovery Problem.

Average%2DCase Performance of the Apriori Algorithm.
The Apriori Algorithm examines baskets of items to determine which subsets of the items occur in lots of baskets. Suppose we wish to determine which items sets occur in at least k baskets. The algorithm considers item sets of size l in the order l = 1, 2, : : : . The only way this algorithm can determine that a set occurs at least k times is to count the k occurrences, but it sometimes determines (without counting) that a set occurs less than k times by noticing that some subsets of the l items occur less than k times. For algorithms that require explicit counting to verify the k occurrences, it is useful to seperate the total time into the &#034;success time&#034;; that is used to verify k occurrences, and the &#034;failure time&#034;; that is used to process sets which have less than k occurrences. This paper derives both exact and asymptotic formulas for both success and failure times in the case where the baskets are filled randomly with probability p (each shopper independently buys each item). The Apriori Algorithm considers almost every possible set of l items for those l where k  bp  l  and almost no sets for larger l. For most applications the largest l such that k  bp  l  is not very large. When it is less than one half of the number of items (essentially the only case of interest), the work associated with this largest such l dominates the running time. The probability that a particular set needs processing approaches zero at a rate that is a negative exponential function of the square of the difference bp  l  \Gamma k when  k is above bp  l  . When k is large compared to 1, the probability that the set needs processing approaches 1 at a similar negative exponential rate.  
Visualizing Query Structure.
user&#039;s ability to interpret graphical representations of data in order to provide insight into properties of the data that may not be identifiable through other, nongraphical means. We seek to answer the following question with this research: &#034;What can we learn from data by looking at the questions that are asked about the data?&#034; In a database context, we view queries as the data of interest, focusing on structural properties of the queries. In this paper we describe a formalism for describing the structural equivalence of queries. We demonstrate an application of our approach by using a graph-based technique to visually represent the structure.
Visual Representation of Database Queries using Structural Similarity.
It is often useful to get high-level views of datasets in order to identify areas of interest worthy of further exploration. In relational databases, the high-level view can be described using Entity-Relationship diagrams, which identify relationships between entities in the data model. Such high-level views are useful for database design activities, and can be used to generate user interfaces for constructing queries. This research introduces techniques for visualizing structural similarity of database queries. We demonstrate that individual queries can be visualized using graph visualization techniques. A distance measure based on query structure is proposed that provides database designers and administrators with a high-level perspective of relationships in the underlying data.
Development of an Informatics Tool for Crystallography Laboratory Administrators.
With increased demand for storage of scientific data comes a corresponding demand for efficient retrieval mechanisms necessary for analytical and reporting purposes. As is often the case, the design of databases to support scientific data is (rightly so) driven by the science. Unfortunately, this &#034;science-centric&#034; view of data management does not make the subsequent reporting of information easy. The natural solution to such a problem is, of course, a data warehouse approach to scientific data management.
Improving Query Evaluation with Approximate Functional Dependency Based Decompositions.
We investigate how relational restructuring may be used to improve query performance.




It%27s All about Process Project Oriented Teaching of Software Engineering.
Process considerations are a central part of the material for a software engineering course; they are also central to accomplishing full-lifecycle, team-based systems development projects in such a course. This paper discusses the ways in whichwehaveachieved an e#ective process structure within an academic context of full-year project courses. The key features are a kernel project plan and a process management mechanism. The project plan is a schedule including eight milestones with #xed due dates and quite explicit deliverables. The management is accomplished through an advanced full-year course, whose participants guide the project teams through the process.
Discoverying Frequent Itemsets in the Presence of Highly Frequent Items.

Discovering Frequent Itemsets in the Presence of Highly Frequent Items.
This paper presents new techniques for focusing the discovery of frequent itemsets within large, dense datasets containing highly frequent items. The existence of highly frequent items adds signi#cantly to the cost of computing the complete set of frequent itemsets. Our approachallows for the exclusion of such items during the candidate generation phase of the Apriori algorithm. Afterwards, the highly frequent items can be reintroduced, via an inferencing framework, providing for a capability to generate frequent itemsets without counting their frequency.
Architectural support for database visualization.
this paper we have introduced an architecture to support database visualization. Central to the architecture is the mapping component, which computes the data coordinates for the visualization based on a defined map. It is the visibility and manipulability of the map that distinguishes this work from other database visualization efforts. Future work will include the development of maps, optimization of the entire process, and usability evaluation
